Modified ant colony optimization with selecting and elimination customer and re-initialization for VRPTW

Vehicle routing problem with time windows (VRPTW) is a special kind of vehicle adding constraints and has variety applications in logistics. Many researchers have attacked the VRPTW by approximate solutions. Ant colony optimization (ACO) classical method to solve but are not used consider customer selection. Most ACO-based algorithms can suffer from complexity such as trapping local optimum. In this paper, we present novel for using selection order decrease or inefficiency ACO process. Moreover, enhance performance searching eliminate these small routes Finally, proposed re-initialization technique Experiments conducted on fifty-six maps dataset shown that achieves encouraging compared other ACOs.